Impossibility of perfectly-secure one-round delegated quantum computing for classical client
نویسندگان
چکیده
منابع مشابه
Quantum-enhanced secure delegated classical computing
We present a family of quantumly-enhanced protocols to achieve unconditionally secure delegated classical computation where the client and the server have both their classical and quantum computing capacity limited. We prove the same task cannot be achieved using only classical protocols. This extends the work of Anders and Browne on the computational power of correlations to a security setting...
متن کاملMultiparty Delegated Quantum Computing
Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantu...
متن کاملOn the implausibility of classical client blind quantum computing
Suppose a large scale quantum computer becomes available over the Internet. Could we delegate universal quantum computations to this server, using only classical communication between client and server, in a way that is information-theoretically blind (i.e., the server learns nothing about the input apart from its size, with no cryptographic assumptions required)? In this paper we give strong i...
متن کاملRound-efficient perfectly secure message transmission scheme against general adversary
In the model of Perfectly Secure Message Transmission Schemes (PSMTs), there are n channels between a sender and a receiver, and they share no key. An infinitely powerful adversary A can corrupt (observe and forge) the messages sent through some subset of n channels. For non-threshold adversaries called Q, Kumar et al. showed a many round PSMT [8]. In this paper, we show round efficient PSMTs a...
متن کاملAsymptotically Optimal Two-Round Perfectly Secure Message Transmission
The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous network of n ≥ 2t + 1 noiseless 2way communication channels. Their goal is to communicate privately and reliably, despite the presence of an adversary that may actively corrupt at most t of those channels. These properties should ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2019
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic19.3-4-2